def get(num, l, r):
    res = 0
    for i in range(l, r - 1, -1):
        res = res * 10 + num[i]
    return res


def power10(x):
    res = 1
    while x:
        res *= 10
        x -= 1
    return res


def count(n, x):
    if not n:
        return 0
    num = []
    while n:
        num.append(n % 10)
        n //= 10
    res = 0
    n = len(num)
    for i in range(n - 1 - (not x), -1, -1):  # 当x == 0时，从次高位位开始，因为第一位不能为零
        if i < n - 1:  # 不处理最高位时
           res += get(num, n - 1, i + 1) * power10(i)  # 前000-abc-1, 后000-999
           if not x:
               res -= power10(i)
        if num[i] == x:
            res += get(num, i - 1, 0) + 1  # 后面的efg + 1, 1是当前的数
        elif num[i] > x:
            res += power10(i)
    return res


while 1:
    a, b = map(int, input().split())
    if a == 0 and b == 0:
        break
    if a > b:
        b, a = a, b
    for i in range(10):
        print(count(b, i) - count(a - 1, i), end=' ')
    print()
